One-to-Many Node Disjoint Paths Routing in Gaussian Interconnection Networks - Ver.9 5/15/13

The cores in parallel systems are connected using interconnection networks. In this work, we consider the Gaussian interconnection networks. Unlike meshes and tori, Gaussian interconnection networks are regular grid-like networks with low degree that can accommodate more nodes with less communication latency. We first design an efficient algorithm with a constant time complexity that constructs node disjoint paths (NDP) from a single source node to the maximum number of destination nodes in the Gaussian interconnection networks without depending on the network size. Then, we prove that this algorithm always returns a solution. Also, we derive the lower and upper bounds of the sum of the NDP lengths and the time complexity of the algorithm. Finally, we show via simulation that on the average 10% more hops than the sum of shortest paths are required to construct the NDP.